Regular Matroids Have Polynomial Extension Complexity
نویسندگان
چکیده
We prove that the extension complexity of independence polytope every regular matroid on [Formula: see text] elements is text]. Past results Wong and Martin extended formulations spanning tree a graph imply bound for special case (co)graphic matroids. However, general was open, despite recent attempts. also consider circuit dominants matroids, which we give bound.
منابع مشابه
The Complexity of Computing the Tutte Polynomial on Transversal Matroids
The complexity of computing the Tutte polynomial T(~/c,x,y) is determined for transversal matroid ,4s and algebraic numbers x and y. It is shown that for fixed x and y the problem of computing T(~,x,y) for JA a transversal matroid is ~pP-complete unless the numbers x and y satisfy (x 1)(y 1) = 1, in which case it is polynomial-time computable. In particular, the problem of counting bases in a t...
متن کاملFamilies of Regular Matroids
This is an introductory paper about the category of regular oriented matroids (ROMs). We compare the homotopy types of the categories of regular and binary matroids. For example, in the unoriented case, they have the same fundamental group but we show that the higher homotopy groups are different for rank three regular and binary matroids. We also speculate on the possible impact of a recent th...
متن کاملk-Regular Matroids
The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF (2) is the class of near-regular matroids. Let k be a non-negative integer. This thesis considers the class of k–regular matroids, a generalization of the last two classes. Indeed, the classes of regular and near-regular matroids coincide wi...
متن کاملDominating Circuits in Regular Matroids
In 1971, Nash-Williams proved that if G is a simple 2-connected graph on n vertices having minimum degree at least 3 (n+ 2), then any longest cycle C in G is also edge-domininating; that is, each edge of G has at least one end-vertex incident with a vertex of C. We say that a circuit C in a matroid M is dominating if each component of M/C has rank at most one. In this paper, we show that an ana...
متن کاملSpanning Circuits in Regular Matroids
We consider the fundamental Matroid Theory problem of finding a circuit in a matroid spanning a set T of given terminal elements. For graphic matroids this corresponds to the problem of finding a simple cycle passing through a set of given terminal edges in a graph. The algorithmic study of the problem on regular matroids, a superclass of graphic matroids, was initiated by Gavenčiak, Král’, and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2022
ISSN: ['0364-765X', '1526-5471']
DOI: https://doi.org/10.1287/moor.2021.1137